Convex object based volume visualization: a formal proof and example

نویسندگان

  • Zou Qingsong
  • Chee-Keong Kwoh
  • Wan Sing Ng
چکیده

In this paper, we provide formal definitions for object space, space subdivision and ray tracing. We also introduce concept models such as ordered space subdivisions and ordered visualization. From these works, we can evaluate the correctness and performance of our space subdivision scheme for volume visualization. With these definitions, we also analyze some established space subdivision approaches such as uniform space subdivision and octree based space subdivision. In this paper, we suggest a new subdivision strategy, the convex object based subdivision scheme, which can be more efficient in generating the convex objects for ordered visualization. r 2001 Elsevier Science Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Segmentation Assisted Object Distinction for Direct Volume Rendering

Ray Casting is a direct volume rendering technique for visualizing 3D arrays of sampled data. It has vital applications in medical and biological imaging. Nevertheless, it is inherently open to cluttered classification results. It suffers from overlapping transfer function values and lacks a sufficiently powerful voxel parsing mechanism for object distinction. In this work, we are proposing an ...

متن کامل

On the Convergence Analysis of Gravitational Search Algorithm

Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...

متن کامل

On the Convergence Analysis of Gravitational Search Algorithm

Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...

متن کامل

Designing and proving correct a convex hull algorithm with hypermaps in Coq

This article presents the formal design of a functional algorithm which computes the convex hull of a finite set of points incrementally. This algorithm, specified in Coq, is then automatically extracted into an OCaml-program which can be plugged into an interface for data input (point selection) and graphical visualization of the output. A formal proof of total correctness, relying on structur...

متن کامل

Convex Surface Visualization Using Rational Bi- cubic Function

The rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. The rational bi-cubic function involves six parameters in each rectangular patch. Data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2001